Decomposing a planar graph with girth 9 into a forest and a matching
نویسندگان
چکیده
W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Planar graphs decomposable into a forest and a matching
He, Hou, Lih, Shao, Wang, and Zhu showed that a planar graph of girth 11 can be decomposed into a forest and a matching. Borodin, Kostochka, Sheikh, and Yu improved the bound on girth to 9. We give sufficient conditions for a planar graph with 3-cycles to be decomposable into a forest and a matching. c © 2008 Elsevier B.V. All rights reserved.
متن کاملThe coloring game on planar graphs with large girth, by a result on sparse cactuses
We denote by χg(G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang. Decomposing a planar gr...
متن کاملLarge induced forests in planar graphs with girth 4 or 5
We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth 4 and 5. In particular we prove that a triangle-free planar graph of order n admits an induced forest of order at least 6n+7 11 , improving the lower bound of Salavatipour [M. R. Salavatipour, Large induced forests in trianglefree planar graphs, Graphs and Combinatorics, 22:113–126, 2006]. We...
متن کاملSplitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
Recently, Borodin, Kostochka, and Yancey (On 1-improper 2-coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth at least 7 can be 2-colored so that each color class induces a subgraph of a matching. We prove that any planar graph of girth at least 6 admits a vertex coloring in 2 colors such that each monochromatic component is a p...
متن کاملAcyclic Colourings of Planar Graphs with Large Girth
An acyclic colouring of a graph G is a proper vertex-colouring of G such that every union of two colour classes induces an acyclic subgraph of G, and χ a ̄ χ a (G) denotes the smallest number of colours in an acyclic colouring of G. Clearly χ a (C ) ̄ 3 if C is a cycle and χ a (F )% 2 if F is a forest, with equality unless F is edgeless. For a planar graph G, Gru$ nbaum [5] conjectured that χ a (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008